A dynamic programming algorithm for multiple-choice constraints
نویسندگان
چکیده
منابع مشابه
A New Dynamic Programming Algorithm for Multiple Sequence Alignment
Abstract. Multiple sequence alignment (MSA) is one of the most basic and central tasks for many studies in modern biology. In this paper, we present a new progressive alignment algorithm for this very difficult problem. Given two groups A and B of aligned sequences, this algorithm uses Dynamic Programming and the sum-of-pairs objective function to determine an optimal alignment C of A and B. Th...
متن کاملAn efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
Article history: Received 24 March 2013 Received in revised form 4 November 2013 Accepted 24 January 2014 Available online 18 February 2014
متن کاملAn efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints
In this paper, we consider a generalized longest common subsequence problem with multiple substring inclusive constraints. For the two input sequences X and Y of lengths n and m, and a set of d constraints P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y including each of constraint string in P as a substring and the length of Z is maximized. A ne...
متن کاملA heuristic for multiple choice programming
A linear programming-based heuristic procedure for solving Multiple choice Programming (MCP) problems is presented. Two pivot schemes which may be viewed as the specialized versions of those in “Pivot and Complement”, an &icicnt heuristic by Balas and Martin for pure O-l programming, are inuxporatai into the procedure along with the additional features of cut generation, variable fixing and uch...
متن کاملA Genetic Algorithm for Choice-Based Network Revenue Management
In recent years, enriching traditional revenue management models by considering the customer choice behavior has been a main challenge for researchers. The terminology for the airline application is used as representative of the problem. A popular and an efficient model considering these behaviors is choice-based deterministic linear programming (CDLP). This model assumes that each customer bel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1984
ISSN: 0898-1221
DOI: 10.1016/0898-1221(84)90055-5